OR Def and Theorem
- Locally optimal
- Convex combination
- Convex set
- Intersection of convex set
- Convex function
- Theorem: convex set if constraint convex (proof)
- Theorem: globally opt if locally opt (proof)
- Affine half-space
- Affine hyperplane
- Polyhedron
- Polytope
- Vertex
- Minkowski Weyl Theorem
- Theorem: polytope has at least 1 opt sol in vertex (proof)
- Basis of A
- Basic solution
- Degenerate basis
- Theorem: basic solution iff vertex (proof)
- Corollary: solution of a polytope has at least 1 opt sol coinciding w bfs
- Optimality test (proof)
- Full reduced cost vector
- Canonical form w.r.t. B
- Tableau form
- Two-phase (naive)
- Bland's Rule (proof)
- Valid inequality
- Theorem: Farkas' Lemma (proof)
- Dual problem
- Weak Duality (proof)
- Optimality conditions
- Analysis of simplex method
- Dual-simplex method (naive)
- Sensitivity analysis (proof)
- ILP
- LP relaxation
- Convex hull
- Theorem: B has det(B)=+-1=> formulation ideal (proof)
- Unimodular matrix
- TUM matrix
- Necessary condition
- Sufficient condition (proof)
- A TUM <=>?
- Cut
- Chvatal inequalities
- Gomory's cut (proof)
- Branch & bound
- Pruning criteria
- Brunch & cut
- Theorem: Prim-Dijkstra prop (proof)
- Kruskal algo (naive)
- Theorem: Djikstra prop (proof)
- Invariant of Floyd Warshall (proof)
- Feasible flow
- Cut
- Flow through cut
- Capacity of cut
- Theorem : Feasible flow and cut (proof)
- Theorem: Ford-Fulkerson prop (proof)
